About polynomials whose divided differences are integer valued on prime numbers
نویسنده
چکیده
We show here how to construct bases of the Z-module Int(P,Z) of polynomials that are integer-valued on the prime numbers together with their finite divided difference, that is, Int(P,Z) = { f ∈ Q[x] | ∀p, q ∈ P f(p) ∈ Z and f(p)− f(q) p− q ∈ Z } .
منابع مشابه
On P -orderings, Rings of Integer-valued Polynomials, and Ultrametric Analysis
Contents 1. Introduction 963 2. A game called í µí±-orderings 967 2.1. On í µí±-removed í µí±-orderings 968 2.2. On í µí±-orderings of order ℎ 969 3. Rings of integer-valued polynomials 969 3.1. Polynomials with integer-valued divided differences 970 3.2. Integer-valued polynomials having a given modulus 973 4. Smooth functions on compact subsets of local fields 976 4.1. The Banach space of...
متن کاملAn Asymptotic Formula for the Number of Smooth Values of a Polynomial
Integers without large prime factors, dubbed smooth numbers, are by now firmly established as a useful and versatile tool in number theory. More than being simply a property of numbers that is conceptually dual to primality, smoothness has played a major role in the proofs of many results, from multiplicative questions to Waring’s problem to complexity analyses of factorization and primality-te...
متن کاملCo-centralizing generalized derivations acting on multilinear polynomials in prime rings
Let $R$ be a noncommutative prime ring of characteristic different from $2$, $U$ the Utumi quotient ring of $R$, $C$ $(=Z(U))$ the extended centroid of $R$. Let $0neq ain R$ and $f(x_1,ldots,x_n)$ a multilinear polynomial over $C$ which is noncentral valued on $R$. Suppose that $G$ and $H$ are two nonzero generalized derivations of $R$ such that $a(H(f(x))f(x)-f(x)G(f(x)))in ...
متن کاملPredicting Prime Numbers Using Cartesian Genetic Programming
Prime generating polynomial functions are known that can produce sequences of prime numbers (e.g. Euler polynomials). However, polynomials which produce consecutive prime numbers are much more difficult to obtain. In this paper, we propose approaches for both these problems. The first uses Cartesian Genetic Programming (CGP) to directly evolve integer based prime-prediction mathematical formula...
متن کاملInteger-valued polynomial in valued fields with an application to discrete dynamical systems
Integer-valued polynomials on subsets of discrete valuation domains are well studied. We undertake here a systematical study of integer-valued polynomials on subsets S of valued fields and of several connected notions: the polynomial closure of S, the Bhargava’s factorial ideals of S and the v-orderings of S. A sequence of numbers is naturally associated to the subset S and a good description c...
متن کامل